Simple Infeasibility Certificates for Attack Trees
نویسندگان
چکیده
We introduce infeasibility certificates, compact and easily verifiable proofs that no profitable attacks exist in the considered system model. We introduce computational methods for generation and validation of such proofs using an enhanced weight reduction technique. A new method for obtaining adversarial expenses by approximating an interval within which this value resides, is an interesting approach to tackle NP-complete tasks and allows to obtain values that require extensive computations in reasonable time.
منابع مشابه
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
We describe simple and exact duals, and certificates of infeasibility and weak infeasibility in conic linear programming which do not rely on any constraint qualification, and retain most of the simplicity of the Lagrange dual. In particular, some of our infeasibility certificates generalize the row echelon form of a linear system of equations, and the “easy” proofs – as sufficiency of a certif...
متن کاملGuaranteed Steady State Bounds for Uncertain (Bio-)Chemical Processes using Infeasibility Certificates
Analysis and safety considerations of chemical and biological processes require complete knowledge of the set of all feasible steady states. Nonlinearities, uncertain parameters, and discrete variables complicate the task of obtaining this set. In this paper, the problem of outer-approximating the region of feasible steady states, for processes described by uncertain nonlinear differential alge...
متن کاملThrowing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates is Moderate
One typically proves infeasibility in satisfiability/constraint satisfaction (or optimality in integer programming) by constructing a tree certificate. However, deciding how to branch in the search tree is hard, and impacts search time drastically. We explore the power of a simple paradigm, that of throwing random darts into the assignment space and then using information gathered by that dart ...
متن کاملNew stopping criteria for detecting infeasibility in conic optimization
Detecting infeasibility in conic optimization and providing certificates for infeasibility pose a bigger challenge than in the linear case due to the lack of strong duality. In this paper we generalize the approximate Farkas lemma of Todd and Ye [12] from the linear to the general conic setting, and use it to propose stopping criteria for interior point algorithms using self-dual embedding. The...
متن کاملInfeasibility Certificates for linear matrix inequalities
Farkas’ lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear matrix inequalities. We provide nonlinear algebraic certificates for all infeasible linear matrix inequalities in the spirit of real algebraic geometry. Mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017